Designing experiments for binary data using search algorithms
نویسنده
چکیده
In some experiments in the physical and biological sciences, a binary response is of primary interest and is often described by a generalized linear model. Examples include experiments in food technology and studies in chemistry where the outcome is whether or not a salt is formed in a chemical reaction. For such experiments, designs that are efficient under the assumption of a linear model may be inadequate for the description and prediction of the response. The generation of designs using a search algorithm is addressed for completely randomized designs when a generalized linear model describes the response. A method of assessing the designs is discussed and illustrated by examples.
منابع مشابه
A Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملOptimization of RFM's Structure Using a New Reformulation of PSO in Case of Limited GCPs
Metaheuristic algorithms have been widely used in determining the optimum rational polynomial coefficients (RPCs). By eliminating a number of unnecessary RPCs, these algorithms increase the accuracy of geometric correction of high-resolution satellite images. To this end, these algorithms use ordinary least squares and a number of ground control points (GCPs) to determine RPCs' values. Due to t...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملDesigning Optimal Binary Search Tree Using Parallel Genetic Algorithms
Evolutionary algorithms (EAs) are modern techniques for searching complex spaces for on optimum [11]. Genetic algorithms (GAs) are developed as random search methods, which have not so sensitivity on primary data of the problems. They can be used in estimation of system parameters in order to obtain the best result. This can be achieved by optimization of an objective function. Genetic programm...
متن کاملDesigning an intelligent system for predicting chromosomal genetic diseases using data mining
Background and Aim: Today we are witnessing tremendous advances in medical data mining. The data, by analyzing and discovering the relationships between them, can lead to algorithms that help us prevent or treat many diseases. Meanwhile, genetic diseases have attracted a large part of the attention of the medical world because the birth of children with genetic disorders imposes a great financi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004